A diffusion generated method for computing Dirichlet partitions
نویسندگان
چکیده
منابع مشابه
A diffusion generated method for computing Dirichlet partitions
A Dirichlet k-partition of a closed d-dimensional surface is a collection of k pairwise disjoint open subsets such that the sum of their first Laplace-BeltramiDirichlet eigenvalues is minimal. In this paper, we develop a simple and efficient diffusion generated method to compute Dirichlet k-partitions for d-dimensional flat tori and spheres. For the 2d flat torus, for most values of k = 3–9,11,...
متن کاملA new diffusion-based multilevel algorithm for computing graph partitions
Graph partitioning requires the division of a graph's vertex set into k equally sized subsets s. t. some objective function is optimized. High-quality partitions are important for many applications, whose objective functions are often NP-hard to optimize. Most state-of-the-art graph partitioning libraries use a variant of the Kernighan-Lin (KL) heuristic within a multilevel framework. While the...
متن کاملMinimal Dirichlet energy partitions for graphs
Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified and a novel rearrangement algorithm is proposed, which we show is strictly decreasing and converges in a finite number of iterations to a local minimum of the ...
متن کاملA Novel Method for VANET Improvement using Cloud Computing
In this paper, we present a novel algorithm for VANET using cloud computing. We accomplish processing, routing and traffic control in a centralized and parallel way by adding one or more server to the network. Each car or node is considered a Client, in such a manner that routing, traffic control, getting information from client and data processing and storing are performed by one or more serve...
متن کاملA convex approach for computing minimal partitions
We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem nds a correct (approximate) solution: we give some arguments to explain why it should be so, and also discuss some situation where it fails.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2019
ISSN: 0377-0427
DOI: 10.1016/j.cam.2018.11.015